Replacement Paths via Row Minima of Concise Matrices
نویسندگان
چکیده
منابع مشابه
Replacement Paths via Row Minima of Concise Matrices
Matrix M is k-concise if the finite entries of each column of M consist of k or fewer intervals of identical numbers. We give an O(n + m)-time algorithm to compute the row minima of any O(1)-concise n×m matrix. Our algorithm yields the first O(n+m)-time reductions from the replacement-paths problem on an n-node m-edge undirected graph (respectively, directed acyclic graph) to the single-source ...
متن کامل-Work Parallel Algorithm for Finding the Row Minima in Totally Monotone Matrices∗
We give a parallel algorithm for computing all row minima in a totally monotone n×nmatrix which is simpler and more work efficient than previous polylogtime algorithms. It runs in O(lg n lg lg n) time doing O(n √ lg n) work on a CRCW PRAM, in O(lg n(lg lg n)2) time doing O(n √ lg n) work on a CREW PRAM, and in O(lg n √ lg n lg lg n) time doing O(n √ lg n lg lg n) work on an EREW PRAM.
متن کاملRow Products of Random Matrices
Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...
متن کاملA Simple Row-replacement Method
Updating a video screen involves row replacement, i.e. the task of updating an existing screen row to produce the desired row. In many environments, screen operations require transmitting characters to the terminal by a process that is painfully slow compared to computing speeds. Thus, it is worth while to compute a minimal set of row updating commands, as long as the time to do so does not out...
متن کاملEstimation of matrices with row sparsity
An increasing number of applications is concerned with recovering a sparsity can be defined in terms of lq balls for q 2 [0, 2), defined as Bq(s) = { v = (vi) 2 R2 : n2 ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2014
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120897146